Vertex-Coloring Graphs with 4-Edge-Weightings
نویسندگان
چکیده
An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield proper vertex coloring graph. It conjectured that for every without isolated edge, with set {1,2,3} exists. In this note, we show statement true weight {1,2,3,4}.
منابع مشابه
Edge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملVertex-coloring edge-weightings of graphs
A k-edge-weighting of a graph G is a mapping w : E(G) → {1, 2, . . . , k}. An edgeweighting w induces a vertex coloring fw : V (G) → N defined by fw(v) = ∑ v∈e w(e). An edge-weighting w is vertex-coloring if fw(u) 6= fw(v) for any edge uv. The current paper studies the parameter μ(G), which is the minimum k for which G has a vertexcoloring k-edge-weighting. Exact values of μ(G) are determined f...
متن کاملOn the complexity of vertex-coloring edge-weightings
Given a graph G = (V,E) and a weight function w : E → R, a coloring of vertices of G, induced by w, is defined by χw(v) = ∑ e3v w(e) for all v ∈ V . In this paper, we show that determining whether a particular graph has a weighting of the edges from {1, 2} that induces a proper vertex coloring is NP-complete.
متن کاملVertex-coloring edge-weightings: Towards the 1-2-3-conjecture
A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such a weighting is possible from the weight set {1, 2, 3, 4, 5} for all graphs not containing components with exactly 2 vertices. All graphs in this note are finite and simple. For notation not defined here we refer the reader to ...
متن کاملVertex-Colouring Edge-Weightings
A weighting w of the edges of a graph G induces a colouring of the vertices of G where the colour of vertex v, denoted cv, is ∑ e3v w(e). We show that the edges of every graph that does not contain a component isomorphic to K2 can be weighted from the set {1, . . . , 30} such that in the resulting vertex-colouring of G, for every edge (u, v) of G, cu 6= cv.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2023
ISSN: ['0209-9683', '1439-6912']
DOI: https://doi.org/10.1007/s00493-023-00027-6